Queues for a Fixed-Cycle Traffic Light
نویسندگان
چکیده
منابع مشابه
Delay Analysis for the Fixed-Cycle Traffic-Light Queue
We consider the fixed-cycle traffic-light (FCTL) queue, where vehicles arrive at an intersection controlled by a traffic light and form a queue. The traffic light signal alternates between green and red periods, and delayed vehicles are assumed to depart during the green period at equal time intervals. Most of the research done on the FCTL queue assumes that the vehicles arrive at the intersect...
متن کاملBounds and Approximations for the Fixed-Cycle Traffic-Light Queue
This paper deals with the fixed-cycle traffic-light (FCTL) queue, where vehicles arrive to an intersection controlled by a traffic light and form a queue. The traffic light alternates between green and red periods, and delayed vehicles are assumed to depart during the green period at equal time intervals. The key performance characteristic in the FCTL queue is the so-called mean overflow, defin...
متن کاملGaussian queues in light and heavy traffic
In this paper we investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. Let Q X ≡ {Q X (t) : t ≥ 0} denote a stationary buffer content process for a fluid queue fed by the centered Gaussian process X ≡ {X(t) : t ∈ R} with stationary increments, X(0) = 0, continuous sample paths and variance function σ 2(·). The system is drained at a constant rate c > 0, so that for a...
متن کاملBasic Limit Theorems for Light Traffic Queues & Their Applications
In this paper, we study some basic limit theorems characterizing the stationary behavior of light traffic queuing systems. Beginning with limit theorems for the simple M/M/1 queuing system, we demonstrate the methodology for applying these theorems for the benefit of service systems. The limit theorems studied here are dominant in the literature. Our contribution is primarily on the analysis le...
متن کاملLight-Traffic Analysis for Queues with Spatially Distributed Arrivals
We consider the following continuous polling system: Customers arrive according to a homogeneous Poisson process (or a more general stationary point process) and wait on a circle in order to be served by a single server. The server is “greedy”, in the sense that he always moves (with constant speed) towards the nearest customer. The customers are served according to an arbitrary service time di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1960
ISSN: 0003-4851
DOI: 10.1214/aoms/1177705787